A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

Hamiltonian cycles in 7-tough (P3 ∪ 2P1)-free graphs

The toughness of a noncomplete graph G is the maximum real number t such that the ratio of $|S|$ to the number of components of $G?S$ is at least t for every cutset S of G. Determining the toughness for a given graph is NP-hard. Chvátal's toughness conjecture, stating that there exists a constant $t_0$ such that every graph with toughness at least $t_0$ is hamiltonian, is still open for general graphs. A graph is called $(P_3\cup 2P_1)$-free if it does not contain any induced subgraph isomorphic to $P_3\cup 2P_1$, the disjoint union of $P_3$ and two isolated vertices. In this paper, we confirm Chvátal's toughness conjecture for $(P_3\cup 2P_1)$-free graphs by showing that every 7-tough $(P_3\cup 2P_1)$-free graph on at least three vertices is hamiltonian.     

Limit cycle bifurcations near a double homoclinic loop with a nilpotent saddle of order m

In this paper, we study the explicit expansion of the first order Melnikov function near a double homoclinic loop passing through a nilpotent saddle of order m in a near-Hamiltonian system. For any positive integer $m(m\ge 1)$, we derive the formulas of the coefficients in the expansion, which can be used to study the limit cycle bifurcations for near-Hamiltonian systems. In particular, for $m=2$, we use the coefficients to consider the limit cycle bifurcations of general near-Hamiltonian systems and give the existence conditions for 10, 11, 13, 15 and 16 (11, 13 and 16, respectively) limit cycles in the case that the homoclinic loop is of cuspidal type (smooth type, respectively) and their distributions. As an application, we consider a near-Hamiltonian system with a nilpotent saddle of order 2 and obtain the lower bounds of the maximal number of limit cycles.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

On tight 6-cycle decompositions of complete 3-uniform hypergraphs

The complete 3-uniform hypergraph of order v has a vertex set V of size v and the set of all 3-element subsets of V as its edge set. A tight 6-cycle is a hypergraph with vertex set $\{a,b,c,d,e,f\}$ and edge set $\{\{a,b,c\},\{b,c,d\},\{c,d,e\},\{d,e,f\},\{e,f,a\},\{f,a,b\}\}$. We show that there exists a decomposition of the complete 3-uniform hypergraph of order v into isomorphic copies of a tight 6-cycle if and only if $v\equiv 1$, 2, 10, 20, 28, or $29(\mathrm{mod}36)$.     

Synthesis,cytotoxicity, apoptosis and cell cycle arrest of a monoruthenium(II)-substituted Dawson polyoxotungstate

By 5-h reaction of cis-[Ru^IICl₂(DMSO)₄] (M2) with K₁₀[α₂-P₂W₁₇O₆₁] (M3) in ice-cooled, HCl-acidic aqueous solution, a water-soluble 1:2-type diamagnetic ruthenium(II) complex of formula K₁₈[Ru^II(DMSO)₂(P₂W₁₇O₆₁)₂]·35H₂O (M1) was unexpectedly obtained as an analytically pure, homogeneous tan-colored solid, in which two DMSO ligands are coordinated to the ruthenium(II) atom. The cytotoxic potential of the complex was tested on C33A, DLD-1, and HepG-2 cancer cells and human normal embryonic lung fibroblasts cell MRC-5; the viability of the treated cells was evaluated by MTT assay. The mode of cell death was assessed by morphological study of DNA damage and apoptosis assays. Compound M1 induced cell death in a dose-dependent manner, and the mode of cell death was essentially apoptosis though necrosis was also noticed. Cell cycle analysis by flow cytometry indicated that M1 caused cell cycle arrest and accumulated cells in S phase.